By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 21, Issue 2, pp. 273-550

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Packing Odd Circuits

Michele Conforti and Bert Gerards

pp. 273-302

BibTeX  Abstract Full Text:  PDF

A Majorization Bound for the Eigenvalues of Some Graph Laplacians

Tamon Stephen

pp. 303-312

BibTeX  Abstract Full Text:  PDF

A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors

Giuseppe Paletta and Paolamaria Pietramala

pp. 313-328

BibTeX  Abstract Full Text:  PDF

Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon

Noga Alon and Eyal Lubetzky

pp. 329-348

BibTeX  Abstract Full Text:  PDF

On Maximum Cost $K_{t,t}$-Free $t$-Matchings of Bipartite Graphs

Márton Makai

pp. 349-360

BibTeX  Abstract Full Text:  PDF

An Improved Approximation of the Achromatic Number on Bipartite Graphs

Guy Kortsarz and Sunil Shende

pp. 361-373

BibTeX  Abstract Full Text:  PDF

Small Diameters of Duals

Jaroslav Nešetřil and Ida Švejdarová

pp. 374-384

BibTeX  Abstract Full Text:  PDF

Forbidden k-Sets in the Plane

Micha A. Perles and Rom Pinchasi

pp. 385-395

BibTeX  Abstract Full Text:  PDF

The Mixing Set with Flows

Michele Conforti, Marco Di Summa, and Laurence A. Wolsey

pp. 396-407

BibTeX  Abstract Full Text:  PDF

RANDOM 2-SAT Does Not Depend on a Giant

David Kravitz

pp. 408-422

BibTeX  Abstract Full Text:  PDF

On the Metric Dimension of Cartesian Products of Graphs

José Cáceres, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María L. Puertas, Carlos Seara, and David R. Wood

pp. 423-441

BibTeX  Abstract Full Text:  PDF

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs

Vojtěch Rödl, Andrzej Ruciński, and Mathias Schacht

pp. 442-460

BibTeX  Abstract Full Text:  PDF

Circular Coloring the Plane

Matt DeVos, Javad Ebrahimi, Mohammad Ghebleh, Luis Goddyn, Bojan Mohar, and Reza Naserasr

pp. 461-465

BibTeX  Abstract Full Text:  PDF

The Lempel–Ziv Complexity of Fixed Points of Morphisms

Sorin Constantinescu and Lucian Ilie

pp. 466-481

BibTeX  Abstract Full Text:  PDF

Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks

C. A. J. Hurkens, J. C. M. Keijsper, and L. Stougie

pp. 482-503

BibTeX  Abstract Full Text:  PDF

Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems

Akiyoshi Shioura and Ken'ichiro Tanaka

pp. 504-522

BibTeX  Abstract Full Text:  PDF

Further Results on Bar k-Visibility Graphs

Stephen G. Hartke, Jennifer Vandenbussche, and Paul Wenger

pp. 523-531

BibTeX  Abstract Full Text:  PDF

Optimal Tree Structures for Group Key Management with Batch Updates

Ronald L. Graham, Minming Li, and Frances F. Yao.

pp. 532-547

BibTeX  Abstract Full Text:  PDF

Erratum: Enumerating Typical Circulant Covering Projections onto a Circulant Graph

Rongquan Feng, Jin Ho Kwak, and Young Soo Kwon

pp. 548-550

BibTeX  Abstract Full Text:  PDF